An almost O(log k)-approximation for k-connected subgraphs
نویسنده
چکیده
We consider two cases of the Survivable Network Design (SND) problem: given a complete graph Gn = (V,En) with costs on the edges and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum cost subgraph G of Gn that contains r(u, v) internally disjoint uv-paths for all u, v ∈ V . Our main result is an O (
منابع مشابه
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms
The main focus of this paper is the analysis of a simple randomized scheme for constructing low-weight k-connected spanning subgraphs. We first show that our scheme gives a simple approximation algorithm to construct a minimum-weight k-connected spanning subgraph in a weighted complete graph, a NP-hard problem even if the weights satisfy the triangle inequality. We show that our algorithm gives...
متن کاملAn O(log k)-approximation algorithm for the k-vertex connected subgraph problem
We present an O(log n · log k)-approximation algorithm for the problem of finding k-vertex connected spanning subgraph of minimum cost, where n is the number of vertices in the input graph, and k is the connectivity requirement. Our algorithm works for both directed and undirected graphs. The best known approximation guarantees for this problems are O(ln k · min{ √ k, n n−k ln k}) by Kortsarz a...
متن کاملThe Price of Connectedness in Expansions
Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion which naturally arises in a number of applications. Our main tool for this investigation is the branchwidth of a graph. In particular, we prove that any 2-edge-connected graph of branchwidth k has a connected branch decomposition of width k, i.e., a branch decompositi...
متن کاملDistance-Preserving Subgraphs of Interval Graphs
We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs with k terminal vertices. We prove the following results. 1. Finding an optimal distance-preserving subgraph is NP-hard for general graphs. 2. Every interval graph admits a subgraph with O(k) branching vertices that approximates pairwise terminal distances up to an additive term of +...
متن کاملMin-Cost 2-Connected Subgraphs With k Terminals
In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also specifies a subset S ⊆ V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009